Optimal approximation order of piecewise constants on convex partitions
نویسندگان
چکیده
منابع مشابه
Approximation by piecewise constants on convex partitions
We show that the saturation order of piecewise constant approximation in Lp norm on convex partitions with N cells is N −2/(d+1), where d is the number of variables. This order is achieved for any f ∈ W 2 p (Ω) on a partition obtained by a simple algorithm involving an anisotropic subdivision of a uniform partition. This improves considerably the approximation order N−1/d achievable on isotropi...
متن کاملConvex Partitions of Graphs induced by Paths of Order Three
In [4] Bollobás considers “The spread of an infection on a square grid”. Initially some squares of a square grid are infected. The infection spreads to an uninfected square if at least two of the neighbouring squares are infected. A natural combinatorial problem — solved using an elegant perimeter argument in [4] — is to determine the minimum number of initially infected squares such that event...
متن کاملPiecewise Convex-Concave Approximation in the $\ell_{\infty}$ Norm
Suppose that f ∈ IR is a vector of n error-contaminated measurements of n smooth values measured at distinct and strictly ascending abscissae. The following projective technique is proposed for obtaining a vector of smooth approximations to these values. Find y minimizing ‖y− f‖∞ subject to the constraints that the second order consecutive divided differences of the components of y change sign ...
متن کاملDiscrete Piecewise Monotonic Approximation by a Strictly Convex Distance Function
Theory and algorithms are presented for the following smoothing problem. We are given n measurements of a real-valued function that have been altered by random errors caused by the deriving process. For a given integer k , some efficient algorithms are developed that approximate the data by minimizing the sum of strictly convex functions of the errors in such a way that the approximated values ...
متن کاملOptimal convex partitions of point sets with few inner points
We present a fixed-parameter algorithm for the Minimum Convex Partition and the Minimum Weight Convex Partition problem. On a set P of n points the algorithm runs in O(2kn +n logn) time. The parameter k is the number of points in P lying in the interior of the convex hull of P .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2020
ISSN: 0885-064X
DOI: 10.1016/j.jco.2019.101444